翻訳と辞書 Words near each other ・ Generation of binomial series using calculus ・ Generation of Chaos ・ Generalized Pochhammer symbol ・ Generalized Poincaré conjecture ・ Generalized polygon ・ Generalized processor sharing ・ Generalized Procrustes analysis ・ Generalized pustular psoriasis ・ Generalized quadrangle ・ Generalized quantifier ・ Generalized randomized block design ・ Generalized relative entropy ・ Generalized Riemann hypothesis ・ Generalized second-price auction ・ Generalized selection ・ Generalized semi-infinite programming ・ Generalized signal averaging ・ Generalized singular value decomposition ・ Generalized spectrogram ・ Generalized star height problem ・ Generalized suffix tree ・ Generalized symmetric group ・ Generalized System of Preferences ・ Generalized taxicab number ・ Generalized Timing Formula ・ Generalized Tobit ・ Generalized tree alignment ・ Generalized trichoepithelioma ・ Generalized trigonometry ・ Generalized TTL security mechanism Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Generalized semi-infinite programming ： ウィキペディア英語版 Generalized semi-infinite programming In mathematics, a semi-infinite programming (SIP) problem is an optimization problem with a finite number of variables and an infinite number of constraints. The constraints are typically parameterized. In a generalized semi-infinite programming (GSIP) problem, the feasible set of the parameters depends on the variables.〔O. Stein and G. Still, ''On generalized semi-infinite optimization and bilevel optimization'', European J. Oper. Res., 142 (2002), pp. 444-462〕 == Mathematical formulation of the problem == The problem can be stated simply as: :$\backslash min\backslash limits\_\backslash ;\backslash ;\; f(x)$ :$\backslash mbox\backslash$ ::$g(x,y)\; \backslash le\; 0,\; \backslash ;\backslash ;\; \backslash forall\; y\; \backslash in\; Y(x)$ where :$f:\; R^n\; \backslash to\; R$ :$g:\; R^n\; \backslash times\; R^m\; \backslash to\; R$ :$X\; \backslash subseteq\; R^n$ :$Y\; \backslash subseteq\; R^m.$ In the special case that the set :$Y(x)$ is nonempty for all $x\; \backslash in\; X$ GSIP can be cast as bilevel programs (Multilevel programming). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Generalized semi-infinite programming」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.